Aneulerian digraphs and the determination of those Eulerian digraphs having an odd number of directed Eulerian paths

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Obstructions to directed embeddings of Eulerian digraphs in the plane

A 2-cell embedding of an Eulerian digraph in a closed surface is said to be directed if the boundary of each face is a directed closed walk in G. We prove Kuratowski-type theorems about obstructions to directed embeddings of Eulerian digraphs in the plane.

متن کامل

The Diameter of Almost Eulerian Digraphs

Soares [J. Graph Theory 1992] showed that the well known upper bound 3 δ+1n+ O(1) on the diameter of undirected graphs of order n and minimum degree δ also holds for digraphs, provided they are eulerian. In this paper we investigate if similar bounds can be given for digraphs that are, in some sense, close to being eulerian. In particular we show that a directed graph of order n and minimum deg...

متن کامل

Eulerian digraphs and Dyck words, a bijection

The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph. 1. Background, and ...

متن کامل

Embedding quartic Eulerian digraphs on the plane

Minimal obstructions for embedding 4-regular Eulerian digraphs on the plane are considered in relation to the partial order defined by the cycle removal operation. Their basic properties are provided and all obstructions with parallel arcs are classified. ∗ The author is thankful for support from the Marsden Fund (Grant Number UOA-825) administered by the Royal Society of New Zealand. This gran...

متن کامل

Synchronizing Finite Automata on Eulerian Digraphs

1 Cern2 y’s conjecture and the road coloring problem are two open problems concerning synchronization of !nite automata. We prove these conjectures in the special case that the vertices have uniform inand outdegrees. c © 2002 Elsevier Science B.V. All rights reserved.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1978

ISSN: 0012-365X

DOI: 10.1016/0012-365x(78)90048-1